Search results for "Mealy machine"

showing 3 items of 3 documents

Machine Morphisms And Simulation

2012

This paper examines the concept of simulation from a modelling viewpoint. How can one Mealy machine simulate the other one? We create formalism for simulation of Mealy machines. The injective s–morphism of the machine semigroups induces the simulation of machines [1]. We present the example of s–morphism such that it is not a homomorphism of semigroups. The story for the surjective s–morphisms is quite different. These are homomorphisms of semigroups but there exists the surjective s–morphism such that it does not induce the simulation.

Mathematics::Algebraic GeometryMealy machineMathematics::Category Theorysurjective s–morphisms.injective s–morphismsimulationmachine semigroup
researchProduct

The completely distributive lattice of machine invariant sets of infnite words

2007

Mealy machineDiscrete mathematicsAlgebra and Number TheoryApplied MathematicsDistributive latticeInvariant (mathematics)Completely distributive latticeBirkhoff's representation theoremCongruence lattice problemMathematicsDiscussiones Mathematicae - General Algebra and Applications
researchProduct

Some Algebraic Properties of Machine Poset of Infinite Words

2008

The complexity of infinite words is considered from the point of view of a transformation with a Mealy machine that is the simplest model of a finite automaton transducer. We are mostly interested in algebraic properties of the underlying partially ordered set. Results considered with the existence of supremum, infimum, antichains, chains and density aspects are investigated.

Mealy machineDiscrete mathematicsFinite-state machineGeneral MathematicsEssential supremum and essential infimumInfimum and supremumComputer Science ApplicationsTransformation (function)Chain (algebraic topology)Point (geometry)Partially ordered setComputer Science::Formal Languages and Automata TheorySoftwareMathematicsRAIRO - Theoretical Informatics and Applications
researchProduct